Compatible matrices of Spearman’s rank correlation
نویسندگان
چکیده
منابع مشابه
Correlation Clustering with Low-Rank Matrices
Correlation clustering is a technique for aggregating data based on qualitative information about which pairs of objects are labeled ‘similar’ or ‘dissimilar.’ Because the optimization problem is NP-hard, much of the previous literature focuses on finding approximation algorithms. In this paper we explore how to solve the correlation clustering objective exactly when the data to be clustered ca...
متن کاملOn higher rank numerical hulls of normal matrices
In this paper, some algebraic and geometrical properties of the rank$-k$ numerical hulls of normal matrices are investigated. A characterization of normal matrices whose rank$-1$ numerical hulls are equal to their numerical range is given. Moreover, using the extreme points of the numerical range, the higher rank numerical hulls of matrices of the form $A_1 oplus i A_2$, where $A_1...
متن کاملRank-based Tapering Estimation of Bandable Correlation Matrices
The nonparanormal model assumes that variables follow a multivariate normal distribution after a set of unknown monotone increasing transformations. It is a flexible generalization of the normal model but retains the nice interpretability of the latter. In this paper we propose a rank-based tapering estimator for estimating the correlation matrix in the nonparanormal model in which the variable...
متن کاملColor Texture Classification under Different Illuminations Using Rank Correlation Matrices
Color has been shown to be useful in the context of texture classification. However, since under different illuminations color is not stable, color invariant descriptors should be defined when the illumination of the query is unknown. In this paper, we propose to characterize color textures by analyzing the rank correlation of color planes between pixels locally close to each other. Thus, consi...
متن کاملSome rank equalities for finitely many tripotent matrices
A rank equality is established for the sum of finitely many tripotent matrices via elementary block matrix operations. Moreover, by using this equality and Theorems 8 and 10 in [Chen M. and et al. On the open problem related to rank equalities for the sum of finitely many idempotent matrices and its applications, The Scientific World Journal 2014 (2014), Article ID 702413, 7 page...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Statistics & Probability Letters
سال: 2019
ISSN: 0167-7152
DOI: 10.1016/j.spl.2019.03.015